منابع مشابه
Clique-based Method for Social Network Clustering
In this paper, we develop some clique-based methods for social network clustering. The quality of clustering result is measured by a novel cliquebased index, which is innovated from the modularity index proposed in [12]. We design an effective algorithm based on recursive bipartition in order to maximize the objective function of the proposed index. Noting the optimization of the objective func...
متن کاملDeep Graph Clustering in Social Network
In this paper, we present deep attributes residue graph algorithm (DARG), a novel model for learning deep representations of graph. The algorithm can discover clusters by taking into consideration node relevance. DARG does so by first learns attributes relevance and cluster deep representations of vertices appearing in a graph, unlike existing work, integrates content interactions of the nodes ...
متن کاملRefining Graph Partitioning for Social Network Clustering
Graph partitioning is a traditional problem with many applications and a number of high-quality algorithms have been developed. Recently, demand for social network analysis arouses the new research interest on graph clustering. Social networks differ from conventional graphs in that they exhibit some key properties which are largely neglected in popular partitioning algorithms. In this paper, w...
متن کاملClustering on Dynamic Social Network Data
This paper presents a reference data set along with a labeling for graph clustering algorithms, especially for those handling dynamic graph data. We implemented a modification of Iterative Conductance Cutting and a spectral clustering. As base data set we used a filtered part of the Enron corpus. Different cluster measurements, as intra-cluster density, inter-cluster sparseness, and Q-Modularit...
متن کاملModel-Based Method for Social Network Clustering
We propose a simple mixed membership model for social network clustering in this note. A flexible function is adopted to measure affinities among a set of entities in a social network. The model not only allows each entity in the network to possess more than one membership, but also provides accurate statistical inference about network structure. We estimate the membership parameters by using a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology and Computer Science
سال: 2013
ISSN: 2074-9007,2074-9015
DOI: 10.5815/ijitcs.2014.01.09